Quality Up in Polynomial Homotopy Continuation by Multithreaded Path Tracking
نویسندگان
چکیده
Speedup measures how much faster we can solve the same problem using many cores. If we can afford to keep the execution time fixed, then quality up measures how much better the solution will be computed using many cores. In this paper we describe our multithreaded implementation to track one solution path defined by a polynomial homotopy. Limiting quality to accuracy and confusing accuracy with precision, we strive to offset the cost of multiprecision arithmetic running multithreaded code on many cores.
منابع مشابه
Numerical Stablity of Path Tracing in Polyhedral Homotopy Continuation Methods
The reliability of polyhedral homotopy continuation methods for solving a polynomial system becomes increasingly important as the dimension of the polynomial system increases. High powers of the homotopy continuation parameter t and ill-conditioned Jacobian matrices encountered in tracing of homotopy paths affect the numerical stability. We present modified homotopy functions with a new homotop...
متن کاملEfficient endgames and path tracking methods
Path tracking is the fundamental computational tool in homotopy continuation and is therefore key in most algorithms in the emerging field of numerical algebraic geometry. Though the basic notions of predictor-corrector methods have been known for years, there is still much to be considered, particularly in the specialized algebraic setting of solving polynomial systems. This article considers ...
متن کاملTheory and Applications in Numerical Algebraic Geometry
by Daniel James Bates Homotopy continuation techniques may be used to approximate all isolated solutions of a polynomial system. More recent methods which form the crux of the young field known as numerical algebraic geometry may be used to produce a description of the complete solution set of a polynomial system, including the positive-dimensional solution components. There are four main topic...
متن کاملPolynomial Homotopies for Dense, Sparse and Determinantal Systems
Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution of a generic system that is used to start up the deformations. Software and applications are discussed. AMS Subject Classification. 14N10, 14M15, 52A39, 52B...
متن کاملOptimization problem in multi-homogeneous homotopy method
Multi-homogeneous homotopy continuation method is one of the most efficient approaches in solving all isolated solutions of a polynomial system of equations. Finding the optimal partition of variables with the minimal multihomogeneous Bézout number is clearly an optimization problem. Multi-homogeneous continuation using the optimal partition of variables reduces the computational cost in path t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1109.0545 شماره
صفحات -
تاریخ انتشار 2011